package acm;

import java.util.Scanner;

public class 矩阵乘法 {
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        int m,s,n,sum=0,x=0,y=0;
        m=in.nextInt();
        s=in.nextInt();
        n=in.nextInt();
        int a[][] = new int[m][s];
        int b[][] = new int[s][n];
        int c[][] = new int[m][n];
        for (int i=0;i<m;i++){
            for (int j=0;j<s;j++){
                a[i][j]=in.nextInt();
            }
        }
        for (int i=0;i<s;i++){
            for (int j=0;j<n;j++){
                b[i][j]=in.nextInt();
            }
        }
        for (int z=0;z<m;z++) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < s; j++) {
                    c[x][y] = c[x][y] + (a[x][j] * b[j][i]);
                }
                y++;
            }
            x++;
            y=0;
        }
        for (int i=0;i<m;i++){
            for (int j=0;j<n;j++){
                 if (sum==0){
                     System.out.print(c[i][j]);
                     sum++;
                 }
                 else {
                     System.out.print(" "+c[i][j]);
                 }
            }
            System.out.println();
            sum=0;
        }
    }
}
